Modified Multilevel Fast Multipole Algorithm for Stationary Iterative Solvers
نویسندگان
چکیده
منابع مشابه
Efficient Preconditioning Strategies for the Multilevel Fast Multipole Algorithm
For the iterative solutions of the integral equation methods employing the multilevel fast multipole algorithm (MLFMA), effective preconditioning techniques should be developed for robustness and efficiency. Preconditioning techniques for such problems can be broadly classified as fixed preconditioners that are generated from the sparse near-field matrix and variable ones that can make use of M...
متن کاملIterative Solvers for Discretized Stationary Euler Equations
In this paper we treat subjects which are relevant in the context of iterative methods in implicit time integration for compressible flow simulations. We present a novel renumbering technique, some strategies for choosing the time step in the implicit time integration, and a novel implementation of a matrix-free evaluation for matrix-vector products. For the linearized compressible Euler equati...
متن کاملFast Iterative Solvers for Discrete Stokes Equations
Abstract. We consider saddle point problems that result from the finite element discretization of stationary and instationary Stokes equations. Three efficient iterative solvers for these problems are treated, namely the preconditioned CG method introduced by Bramble and Pasciak, the preconditioned MINRES method and a method due to Bank et al. We give a detailed overview of algorithmic aspects ...
متن کاملFast iterative solvers for thin structures
For very large systems of equations arising from 3D finite element formulation, pre-conditioned iterative solvers are preferred over direct solvers due to their reduced memory requirements. However, in the finite-element analysis of thin structures such as beam and plate structures, iterative solvers perform poorly due to the presence of poor quality elements. In particular, their efficiency dr...
متن کاملMultilevel Fast Multipole Algorithmfor Solving Combined Field
The fast multipole method (FMM) has been implemented to speed up the matrix-vector multiply when an iterative method is used to solve combined eld integral equation (CFIE). FMM reduces the complexity from O(N 2) to O(N 1:5). With a multilevel fast multipole algorithm (MLFMA), it is further reduced to O(NlogN). A 110,592 unknown problem can be solved within 24 hours on a SUN Sparc10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2015
ISSN: 2169-3536
DOI: 10.1109/access.2015.2437876